FSA: A Fast Stepwise Addition Algorithm for Constructing Phylogenetic Trees

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A fast algorithm for constructing image identification

In the transmission of remote images, a typical scenario may be one in which a user is searching through an image database which contains a large number of different images, only a small number of which are of interest. In order to select the desired image, the user may have to download (from a remote site) the complete image itself. Instead of downloading the complete image, it would save time...

متن کامل

Understanding phylogenies: Constructing and Interpreting Phylogenetic trees

Interpretation of phylogenetic trees is fundamental in understanding the relationships between organisms, their traits or characteristics, their ecology and even their genomic and developmental biology. As trees appear more often in basic texts, many students, and even their teachers, clearly understand little of how they are constructed and even less about what can be inferred from them about ...

متن کامل

Constructing Phylogenetic Trees Using Maximum Likelihood

Maximum likelihood methods are used to estimate the phylogenetic trees for a set of species. The probabilities of DNA base substitutions are modeled by continuous-time Markov chains. We use these probabilities to estimate which DNA bases would produce the data that we observe. The topology of the tree is also determined using base substitution probabilities and conditional likelihoods. Felsenst...

متن کامل

Constructing phylogenetic trees efficiently using compatibility criteria

The Character Compatibility Problem is a classical problem in computational biology concerned with constructing phylogenetic trees of minimum possible evolution from qualitative character sets. This problem arose in the 1970s, and until recently the only cases for which efficient algorithms were found were for binary (i.e. twostate) characters and for two characters at a time, while the complex...

متن کامل

Constructing phylogenetic trees in individual based models

Understanding the emergence of biodiversity patterns in nature is a central problem in biology. Theoretical models of speciation have addressed this question in the macroecological scale, but little has been investigated in the macroevolutionary context. Knowledge of the evolutionary history allows the study of patterns underlying the processes considered in these models, revealing their signat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Bioscience, Biochemistry and Bioinformatics

سال: 2014

ISSN: 2010-3638

DOI: 10.7763/ijbbb.2014.v4.372